A fast thresholded linear convolution representation of morphological operations
نویسندگان
چکیده
In this correspondence, we present a fast thresholded linear convolution representation of morphological operations. The thresholded linear convolution representation of dilation and erosion is first proposed. A comparison of the efficiency of the direct implementation of morphological operations and the thresholded linear convolution representation of morphological operations is subsequently conducted. Mathematical morphology has emerged as a powerful new tool for image processing.
منابع مشابه
Efficient convolution based algorithms for erosion and dilation
Morphological operations based on primitives such as dilation and erosion are slow to compute in practice especially for large structuring elements. For direct implementation of these primitives, the computing time grows exponentially with the size of the structuring element used. The latter renders these implementations impractical for large structuring elements due to a rapid increase in comp...
متن کاملConvolution using the undecimated discrete wavelet transform
Convolution is one of the most widely used digital signal processing operations. It can be implemented using the fast Fourier transform (FFT), with a computational complexity ofO(N logN). The undecimated discrete wavelet transform (UDWT) is linear and shift invariant, so it can also be used to implement convolution. In this paper, we propose a scheme to implement the convolution using the UDWT,...
متن کاملA Stochastic Roundoff Error Analysis for the Convolution
We study the accuracy of an algorithm which computes the convolution via Radix-2 fast Fourier transforms. Upper bounds are derived for the expected value and the variance of the accompanying linear forms in terms of the expected value and variance of the relative roundoff errors for the elementary operations of addition and multiplication. These results are compared with the corresponding ones ...
متن کاملMorphological filters-Part I: Their set-theoretic analysis and relations to linear shift-invariant filters
This paper examines the set-theoretic interpretation of morphological filters in the framework of mathematical morphology and introduces the representation of classical linear filters in terms of morphological correlations, which involve supremumlinfimum operations and additions. Binary signals are classified as sets, and multilevel signals as functions. Two set-theoretic representations of sig...
متن کاملFast Image Operations in Wavelet Spaces
Wavelet transforms have been widely applied to image and video compression but they also have the ability to compress operators. A result is that there is great potential for producing fast algorithms for the processing of wavelet compressed image and video data. We examine the implementation of a set of fundamental image operations including pixel-wise arithmetic operators and arbitrary linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 3 4 شماره
صفحات -
تاریخ انتشار 1994